Improving the Hierarachical Stochastic Radiosity Algorithm
نویسندگان
چکیده
Hierarchical subdivision techniques remove the need for a-priori meshing of surfaces when approximating global illumination. In addition they allow progressive re nement of the solution. However, when subdivision is based upon Monte Carlo methods, due to the stochastic nature of such techniques, subdivision decisions cannot be made unless a su ciently large number of samples have been considered. Shadow boundaries are one of the main features such subdivision algorithms are designed to detect, but mesh elements that are in shadow receive less light, and hence are slower to subdivide. In this paper we investigate methods for modifying the Monte Carlo hierarchical subdivision algorithm to improve the detection of shadow boundaries and caustics.
منابع مشابه
Towards Optimal Combination of Shooting and Gathering Stochastic Radiosity
This paper deals with combination of shooting and gathering stochastic radiosity methods. The basic two-pass methods are reviewed and other new methods are proposed. The fundamental motivation for this paper is to develop an iterative two-pass stochastic radiosity that provides the progressive refinement feature of both types of radiosity algorithms. We want to give the user a new, better, solu...
متن کاملThe Computation of Higher-Order Radiosity Approximations with a Stochastic Jacobi Iterative Method
The computation of higher-order polynomial radiosity approximations on a fixed element mesh, results in more smooth images than with a traditional piecewise constant radiosity approximation. Unfortunately, the number of form factors to be stored in a deterministic approach is considerably higher than with a constant approximation and the computation itself of the form factors is more difficult....
متن کاملPerceptually-driven Termination for Stochastic Radiosity
In this paper we present a heuristic perceptually-based termination criterion for a stochastic radiosity algorithms. The proposed criterion makes it possible to terminate the iterative radiosity simulation as soon as any further changes of the radiosity solution are predicted not to be noticed by the human observer. We use tone mapping operators and perceptually uniform CIE L u v colour space t...
متن کاملRadiosity with Well Distributed Ray Sets
In this paper we present a new radiosity algorithm, based on the notion of a well distributed ray set (WDRS). A WDRS is a set of rays, connecting mutually visible points and patches, that forms an approximate representation of the radiosity operator and the radiosity distribution. We propose an algorithm that constructs an optimal WDRS for a given accuracy and mesh. The construction is based on...
متن کاملStream Processing in Global Illumination
This paper presents the implementation of the stochastic radiosity algorithm on the graphics hardware. We store the radiosity function in texels of the floating point pbuffer. The radiosity function is updated in each iteration. When converged, the radiosity function is mapped onto surfaces by traditional texture mapping. Our goal is to enable interactive radiosity style rendering of scenes wit...
متن کامل